On Two Forms of Bureaucracy in Derivations
نویسندگان
چکیده
We call irrelevant information in derivations bureaucracy. An example of such irrelevant information is the order between two consecutive inference rules that trivially permute. Building on ideas by Guglielmi, we identify two forms of bureaucracy that occur in the calculus of structures (and, in fact, in every non-trivial term rewriting derivation). We develop term calculi that provide derivations that do not contain this bureaucracy. We also give a normalisation procedure that removes bureaucracy from derivations and find that in a certain sense the normalisation process is a process of cut elimination.
منابع مشابه
Employee engagement and two types of bureaucracy: An investigation into the top-four Iranian universities
The purpose of this study is to investigate the impact of bureaucratic structure on the employee engagement (EE). Our study extends previous researches by considering bureaucracy from two points of view: enabling versus hindering. We study the extent to which these two types of bureaucracy are related to the two forms of employee engagement: organizational (OE) and work engagement (WE). The vie...
متن کاملFrom Deep Inference to Proof Nets
This paper shows how derivations in (a variation of) SKS can be translated into proof nets. Since an SKS derivation contains more information about a proof than the corresponding proof net, we observe a loss of information which can be understood as “eliminating bureaucracy”. Technically this is achieved by cut reduction on proof nets. As an intermediate step between the two extremes, SKS deriv...
متن کاملStructures and Deduction – the Quest for the Essence of Proofs ( satellite workshop of ICALP 2005 ) Paola
This paper shows how derivations in (a variation of) SKS can be translated into proof nets. Since an SKS derivation contains more information about a proof than the corresponding proof net, we observe a loss of information which can be understood as “eliminating bureaucracy”. Technically this is achieved by cut reduction on proof nets. As an intermediate step between the two extremes, SKS deriv...
متن کاملStructures and Deduction – the Quest for the Essence of Proofs ( satellite workshop of ICALP 2005 )
This paper shows how derivations in (a variation of) SKS can be translated into proof nets. Since an SKS derivation contains more information about a proof than the corresponding proof net, we observe a loss of information which can be understood as “eliminating bureaucracy”. Technically this is achieved by cut reduction on proof nets. As an intermediate step between the two extremes, SKS deriv...
متن کاملFrom Deep Inference to Proof Nets via Cut Elimination
This paper shows how derivations in the deep inference system SKS for classical propositional logic can be translated into proof nets. Since an SKS derivation contains more information about a proof than the corresponding proof net, we observe a loss of information which can be understood as “eliminating bureaucracy”. Technically this is achieved by cut reduction on proof nets. As an intermedia...
متن کامل